Category Theory to Yoneda's Lemma
نویسنده
چکیده
This development proves Yoneda's lemma and aims to be readable by humans. It only defines what is needed for the lemma: categories, func-tors and natural transformations. Limits, adjunctions and other important concepts are not included. There is no explanation or discussion in this document. See [O'K04] for this and a survey of category theory formalisations.
منابع مشابه
Implications of Yoneda Lemma to Category Theory
This is a survey paper on the implication of Yoneda lemma, named after Japanese mathematician Nobuo Yoneda, to category theory. We prove Yoneda lemma. We use Yoneda lemma to prove that each of the notions universal morphism, universal element, and representable functor subsumes the other two. We prove that a category is anti-equivalent to the category of its representable functors as a corollar...
متن کاملThe Yoneda Lemma without category theory: algebra and applications
However it can just as well be considered a fundamental representation theorem of universal algebra, via the connection between the homfunctor of a category and free algebras for the theory represented by that category. This connection is not generally appreciated outside category theoretic circles, which this section endeavors to correct by presenting the relevant concepts from an algebraic pe...
متن کاملFuzzy Linear Programming and its Application for a Constructive Proof of a Fuzzy Version of Farkas Lemma
The main aim of this paper is to deal with a fuzzy version of Farkas lemma involving trapezoidal fuzzy numbers. In turns to that the fuzzy linear programming and duality theory on these problems can be used to provide a constructive proof for Farkas lemma. Keywords Farkas Lemma, Fuzzy Linear Programming, Duality, Ranking Functions.
متن کاملTowards a Readable Formalisation of Category Theory
We formally develop category theory up to Yoneda’s lemma, using Isabelle/HOL/Isar, and survey previous formalisations. By using recently added Isabelle features, we have produced a formal text that more closely approximates informal mathematics.
متن کاملGröbner Bases for Operads
We define a new monoidal category on collections (shuffle composition). Monoids in this category (shuffle operads) turn out to bring a new insight in the theory of symmetric operads. For this category, we develop the machinery of Gröbner bases for operads, and present operadic versions of Bergman’s Diamond Lemma and Buchberger’s algorithm. This machinery can be applied to study symmetric operad...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Archive of Formal Proofs
دوره 2005 شماره
صفحات -
تاریخ انتشار 2005